Strategies to Parallelize ILP Systems
نویسندگان
چکیده
It is well known by Inductive Logic Programming (ILP) practioners that ILP systems usually take a long time to find valuable models (theories). The problem is specially critical for large datasets, preventing ILP systems to scale up to larger applications. One approach to reduce the execution time has been the parallelization of ILP systems. In this paper we overview the state-of-the-art on parallel ILP implementations and present work on the evaluation of some major parallelization strategies for ILP. Conclusions about the applicability of each strategy are presented.
منابع مشابه
The Construct of Interlanguage Pragmatic Learning Strategies: Investigating Preferences of High vs. Low Pragmatic Performers
Interlanguage pragmatics (ILP) has witnessed a growing body of research in the past two decades. One of the under-explored domains of L2 pragmatics is the role of learning strategies specifically tailored for the development of ILP knowledge. Therefore, this investigation aimed to determine the significant interlanguage pragmatic learning strategies (IPLS) used by high vs. low L2 pragmatic achi...
متن کاملComparison of Three Parallel Implementations of an Induction Algorithm
Recently, researchers have tried to apply ILP to KDD because ILP enlarges the applicability of Machine Learning to cover KDD and Data Mining: it enables them to learn from multiple relational tables. Many scienti c discovery systems are motivated from the desire to deal with larger databases. However the larger the databases are, the more computational power we need. Parallel computing is a pos...
متن کاملSpeculative Thread Execution in a Multithreaded Dataflow Architecture
Instruction Level Parallelism (ILP) in modern Superscalar and VLIW processors is achieved using out-of-order execution, branch predictions, value predictions, and speculative executions of instructions. These techniques are not scalable. This has led to multithreading and multi-core systems. However, such processors require compilers to automatically extract thread level or task level paralleli...
متن کاملILP Through Propositionalization and Stochastic k-Term DNF Learning
ILP has been successfully applied to a variety of tasks. Nevertheless, ILP systems have huge time and storage requirements, owing to a large search space of possible clauses. Therefore, clever search strategies are needed. One promising family of search strategies is that of stochastic local search methods. These methods have been successfully applied to propositional tasks, such as satisfiabil...
متن کاملApril - An Inductive Logic Programming System
Inductive Logic Programming (ILP) is a Machine Learning research field that has been quite successful in knowledge discovery in relational domains. ILP systems use a set of pre-classified examples (positive and negative) and prior knowledge to learn a theory in which positive examples succeed and the negative examples fail. In this paper we present a novel ILP system called April, capable of ex...
متن کامل